Automatic Algorithm Programming Model Based on the Improved Morgan's Refinement Calculus
نویسندگان
چکیده
The automatic algorithm programming model can increase the dependability and efficiency of program development, including specification generation, refinement, formal verification. However, existing has two flaws: incompleteness refinement inadequate automation This paper proposes an based on improved Morgan's calculus. It extends calculus rules designs C++ generation system for realizing complete process refinement. Meanwhile, tools VCG (Verification Condition Generator) Isabelle are used to improve An example a stock's maximum income demonstrates effectiveness proposed model. Furthermore, some relevance software generation.
منابع مشابه
mortality forecasting based on lee-carter model
over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...
15 صفحه اولAutomatic Algorithm Recognition Based on Programming Schemas
A method for recognizing algorithms by detecting algorithmic schemas is presented. The method uses the findings of the studies on programming schemas, according to which experts develop schemas, high-level cognitive constructs that abstract knowledge of programming structures, and use them in comprehending and solving similar problems that differ in lower level details. We introduce a set of sc...
متن کاملA Partition Refinement Algorithm for the -Calculus
The partition reenement algorithm 10, 6] is the basis for most of the tools for checking bisimulation equivalences and for computing minimal realisations of CCS-like nite state processes. In this paper, we present a partition reenement algorithm for the-calculus 7], a development of CCS where channel names can be communicated. It can be used to check bisimilarity and to compute minimal realisat...
متن کاملAN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM
This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...
متن کاملImproved Leakage Model Based on Genetic Algorithm
The classical leakage model usually exploits the power of one single S-box, which is called divide and conquer. Taking DES algorithm for example, the attack on each S-box needs to search the key space of 2 in a brute force way. Besides, 48-bit round key is limited to the result correctness of each single S-box. In this paper, we put forward a new leakage model based on the power consumption of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wuhan University Journal of Natural Sciences
سال: 2022
ISSN: ['1007-1202', '1993-4998']
DOI: https://doi.org/10.1051/wujns/2022275405